Sorted Downward Reenement: Building Background Knowledge into a Reenement Operator for Inductive Logic Programming
نویسنده
چکیده
Since its inception, the eld of inductive logic programming has been centrally concerned with the use of background knowledge in induction. Yet, surprisingly, no serious attempts have been made to account for background knowledge in reenement operators for clauses, even though such operators are one of the most important, prominent and widely-used devices in the eld. This paper shows how a sort theory, which encodes taxo-nomic knowledge, can be built into a downward, subsumption-based reenement operator for clauses.
منابع مشابه
Re ning Concepts in Description
While the problem of learning logic programs has been extensively studied in ILP, the problem of learning in description logics (DLs) has been studied to a lesser extent. Learning in DLs is however worthwhile , since both Horn logic and description logics are widely used knowledge representation formalisms, their expressive powers being incompa-rable (neither includes the other as a fragment). ...
متن کاملFirst Order Theory Re
This paper summarizes the current state of the art in the topics of rst-order theory revision and theory restructuring. The various tasks involved in rst-order theory reenement (revision vs. restructuring) are deened and then discussed in turn. For theory revision, the issue of minimality is discussed in detail, and a general outline algorithm is given which identiies the major places of diiere...
متن کاملGenerating Numerical Literals During Refinement
Despite the rapid emergence and success of Inductive Logic Programming, problems still surround number handling|problems directly inherited from the choice of logic programs as the representation language. Our conjecture is that a generalisation of the representation language to Constraint Logic Programs provides an eeective solution to this problem. We support this claim with the presentation ...
متن کاملDtre|A Semi-Automatic Transformation System
This paper describes the theoretical framework and an implemented system (Dtre) for the speciication and veriied reenement of speciications using operations on abstract data types. The system is semi-automatic in that users can specify some (possibly none) of the implementations and the system will determine the rest of the implementations. Data types are speciied as parameterized theories with...
متن کاملConstructing Reenement Operators by Decomposing Logical Implication
Inductive learning models 14] 17] often use a search space of clauses, ordered by a generalization hierarchy. To nd solutions in the model, search algorithms use diierent generalization and specialization operators. In this article we will decompose the quasi-ordering induced by logical implication into six increasingly weak orderings. The diierence between two successive orderings will be smal...
متن کامل